Monte Carlo approximation of weakly singular integral operators
نویسندگان
چکیده
منابع مشابه
Monte Carlo approximation of weakly singular integral operators
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite smoothness, we develop a Monte Carlo multilevel method, give convergence estimates and prove lower bounds which show the optimality of this method and establish the complexity. As an application we obtain optimal methods...
متن کاملA Nyström method for weakly singular integral operators on surfaces
We describe a modified Nyström method for the discretization of the weakly singular boundary integral operators which arise from the formulation of linear elliptic boundary value problems as integral equations. Standard Nyström and collocation schemes proceed by representing functions via their values at a collection of quadrature nodes. Our method uses appropriately scaled function values in l...
متن کاملStatistical Approximation by Double Picard Singular Integral Operators
We first construct a sequence of double smooth Picard singular integral operators which do not have to be positive in general. After giving some useful estimates, we mainly show that it is possible to approximate a function by these operators in statistical sense even though they do not obey the positivity condition of the statistical Korovkin theory.
متن کاملMultiresolution separated representations of singular and weakly singular operators ✩
For a finite but arbitrary precision, we construct efficient low separation rank representations for the Poisson kernel and for the projector on the divergence free functions in the dimension d = 3. Our construction requires computing only one-dimensional integrals. We use scaling functions of multiwavelet bases, thus making these representations available for a variety of multiresolution algor...
متن کاملMonte-Carlo Approximation of Temperature
Monte-Carlo tree search is a powerful paradigm for the game of Go. We propose to use Monte-Carlo tree search to approximate the temperature of a game, using the mean result of the playouts. Experimental results on the sum of five 7x7 Go games show that it improves much on a global search algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2006
ISSN: 0885-064X
DOI: 10.1016/j.jco.2005.11.002